//
// Created by zuo on 2024/7/1.
// 题目链接 https://www.lanqiao.cn/problems/1624/learning/?page=1&first_category_id=1&problem_id=1624
// 核心思路  只考虑最多那一堆 的空隙
//

#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n;
    cin >> n;
    ll sum = 0, mx = 0;
    for (int i = 0; i < n; i++)
    {
        ll x;
        cin >> x;
        mx = max(mx, x); // mx 存储最多的那一堆
        sum += x; // sum 存储一共有多少
    }
    // 只要最多的那堆的空隙 被其他堆的个数填满就行
    if (sum - mx >= mx - 1)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;

    return 0;
}
